Online Spectral Identification of Dynamical Systems
نویسندگان
چکیده
Recently, a number of researchers have proposed spectral algorithms for learning models of nonlinear dynamical systems—for example, Hidden Markov Models (HMMs) [1, 2], Partially Observable Markov Decision Processes (POMDPs) [3], and Predictive State Representations (PSRs) [4, 3, 5]. These algorithms are attractive since they are statistically consistent and not subject to local optima. However, they are batch methods: they need to store their entire training data set in memory at once and operate on it as a large matrix, and so they cannot scale to extremely large data sets (either many examples or many features per example). In turn, this restriction limits their ability to learn accurate models of complex systems.
منابع مشابه
Optimal control of switched systems by a modified pseudo spectral method
In the present paper, we develop a modified pseudospectral scheme for solving an optimal control problem which is governed by a switched dynamical system. Many real-world processes such as chemical processes, automotive systems and manufacturing processes can be modeled as such systems. For this purpose, we replace the problem with an alternative optimal control problem in which the switching t...
متن کاملمقایسه روش های طیفی برای شناسایی زبان گفتاری
Identifying spoken language automatically is to identify a language from the speech signal. Language identification systems can be divided into two categories, spectral-based methods and phonetic-based methods. In the former, short-time characteristics of speech spectrum are extracted as a multi-dimensional vector. The statistical model of these features is then obtained for each language. The ...
متن کاملSpectral Filtering for General Linear Dynamical Systems
We give a polynomial-time algorithm for learning latent-state linear dynamical systems without system identification, and without assumptions on the spectral radius of the system’s transition matrix. The algorithm extends the recently introduced technique of spectral filtering, previously applied only to systems with a symmetric transition matrix, using a novel convex relaxation to allow for th...
متن کاملSpectral identification of networks using sparse measurements
We propose a new method to recover global information about a network of interconnected dynamical systems based on observations made at a small number (possibly one) of its nodes. In contrast to classical identification of full graph topology, we focus on the identification of the spectral graph-theoretic properties of the network, a framework that we call spectral network identification. The m...
متن کاملSpectral Approaches to Learning Predictive Representations
A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must obtain an accurate environment model, and then plan to maximize reward. However, for complex domains, specifying a model by hand can be a time consuming process. This motivates an alternative approach: learning a model directly from observation...
متن کامل